A generalization of inverse distance weighting and an equivalence relationship to noise-free Gaussian process interpolation via Riesz representation theorem

In this paper, we show the relationship between two seemingly unrelated approximation techniques. On the one hand, a certain class of Gaussian process-based interpolation methods, and on the other hand inverse distance weighting, which has been developed in the context of spatial analysis where there is often a need for interpolating from irregularly spaced data to produce a continuous surface. We develop a generalization of inverse distance weighting and show that it is equivalent to the approximation provided by the class of Gaussian process-based interpolation methods. The equivalence is established via an elegant application of Riesz representation theorem concerning the dual of a Hilbert space. It is thus demonstrated how a classical theorem in linear algebra connects two disparate domains.     

Completing orientations of partially oriented graphs

We initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P. Orientation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k‐arc‐strong oriented graphs, k‐strong oriented graphs, quasi‐transitive‐oriented graphs, local tournaments, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in‐tournaments, and oriented graphs that have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP‐complete. We also show that some of the NP‐complete problems become polynomial time solvable when the input‐oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable. The latter generalizes a previous result.     

Supereulerian bipartite digraphs

A digraph D is supereulerian if D has a spanning closed ditrail. Bang‐Jensen and Thomassé conjectured that if the arc‐strong connectivity of a digraph D is not less than the independence number , then D is supereulerian. A digraph is bipartite if its underlying graph is bipartite. Let be the size of a maximum matching of D. We prove that if D is a bipartite digraph satisfying , then D is supereulerian. Consequently, every bipartite digraph D satisfying is supereulerian. The bound of our main result is best possible.     

Kadison-Singer代数研究综述

回顾了建立KS-代数的研究背景,系统介绍了KS-代数的定义和性质以及超有限KS-代数、非超有限KS-代数、KS-格的构造和强KS-代数的研究结果,同时分析了KS-代数和经典的不变子空间、Kadison可迁代数、von Neumann代数生成元等问题之间的联系;讨论了非自伴代数的运算,给出了两种不同构造非自伴代数的运算法则;在此基础上,提出了未来学科发展有待研究的16个问题.     

Strong convergence of a general viscosity explicit rule for the sum of two monotone operators in Hilbert spaces

In this paper, we study a general viscosity explicit rule for approximating the solutions of the variational inclusion problem for the sum of two monotone operators. We then prove its strong convergence under some new conditions on the parameters in the framework of Hilbert spaces. As applications, we apply our main result to the split feasibility problem and the LASSO problem. We also give some numerical examples to support our main result. The results presented in this paper extend and improve the corresponding results in the literature.     

Quasi-linear PDEs and forward–backward stochastic differential equations: Weak solutions

In this paper, we study the existence, uniqueness and the probabilistic representation of the weak solutions of quasi-linear parabolic and elliptic partial differential equations (PDEs) in the Sobolev space $H_{\rho }^1({\mathbb{R}}^d)$. For this, we study first the solutions of forward–backward stochastic differential equations (FBSDEs) with smooth coefficients, regularity of solutions and their connection with classical solutions of quasi-linear parabolic PDEs. Then using the approximation procedure, we establish their convergence in the Sobolev space to the solutions of the FBSDES in the space $L_{\rho }^2({\mathbb{R}}^d;{\mathbb{R}}^d)?L_{\rho }^2({\mathbb{R}}^d;{\mathbb{R}}^k)?L_{\rho }^2({\mathbb{R}}^d;{\mathbb{R}}^{k\times d})$. This gives a connection with the weak solutions of quasi-linear parabolic PDEs. Finally, we study the unique weak solutions of quasi-linear elliptic PDEs using the solutions of the FBSDEs on infinite horizon.     

On diagonal actions of branch groups and the corresponding characters

We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acting on a regular rooted tree acts absolutely non-freely on the boundary of the tree. Using this result and the symmetrized diagonal actions we construct for every countable branch group infinitely many different ergodic perfectly non-free actions, infinitely many II₁-factor representations, and infinitely many continuous ergodic invariant random subgroups.     

Real double flag varieties for the symplectic group

In this paper we study a key example of a Hermitian symmetric space and a natural associated double flag variety, namely for the real symplectic group G and the symmetric subgroup L, the Levi part of the Siegel parabolic $P_S$. We give a detailed treatment of the case of the maximal parabolic subgroups Q of L corresponding to Grassmannians and the product variety of $G/P_S$ and $L/Q$; in particular we classify the L-orbits here, and find natural explicit integral transforms between degenerate principal series of L and G.